Dimension-adaptive machine learning-based quantum state reconstruction
نویسندگان
چکیده
We introduce an approach for performing quantum state reconstruction on systems of n qubits using a machine learning-based system trained exclusively m qubits, where ≥ n. This removes the necessity exactly matching dimensionality under consideration with dimension model used training. demonstrate our technique by randomly sampled one, two, and three methods containing at least one additional qubit. The time required scales significantly more favorably than training time; hence this can offer overall saving resources leveraging single neural network dimension-variable reconstruction, obviating need to train dedicated learning each Hilbert space.
منابع مشابه
A dimension adaptive sparse grid combination technique for machine learning
We introduce a dimension adaptive sparse grid combination technique for the machine learning problems of classification and regression. A function over a d-dimensional space, which assumedly describes the relationship between the features and the response variable, is reconstructed using a linear combination of partial functions who possibly depend only on a subset of all features. The partial ...
متن کاملAdaptive Assessment Based on Machine Learning Technology
In the e-learning environment we use adaptive assessment based on machine learning technology called regression tree. In the paper we analyse the properties of the regression tree assessment.
متن کاملAdaptive Kernel Based Machine Learning Methods
During the support period July 1, 2011 June 30, 2012, seven research papers were published. They consist of three types: • Research that directly addresses the kernel selection problem in machine learning [1, 2]. • Research that closely relates to the fundamental issues of the proposed research of this grant [3, 4, 5, 6]. • Research that is in the general context of computational mathematics [7...
متن کاملLearning state machine-based string edit kernels
During the past few years, several works have been done to derive string kernels from probability distributions. For instance, the Fisher kernel uses a generative model M (e.g. a hidden markov model) and compares two strings according to how they are generated by M . On the other hand, the marginalized kernels allow the computation of the joint similarity between two instances by summing condit...
متن کاملQuantum adiabatic machine learning
We develop an approach to machine learning and anomaly detection via quantum adiabatic evolution. In the training phase we identify an optimal set of weak classifiers, to form a single strong classifier. In the testing phase we adiabatically evolve one or more strong classifiers on a superposition of inputs in order to find certain anomalous elements in the classification space. Both the traini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Machine Intelligence
سال: 2022
ISSN: ['2524-4906', '2524-4914']
DOI: https://doi.org/10.1007/s42484-022-00088-8